Efficient High Quality Rendering of Point Sampled Geometry

نویسندگان

  • Mario Botsch
  • Andreas Wiratanaya
  • Leif Kobbelt
چکیده

We propose a highly efficient hierarchical representation for point sampled geometry that automatically balances sampling density and point coordinate quantization. The representation is very compact with a memory consumption of far less than 2 bits per point position which does not depend on the quantization precision. We present an efficient rendering algorithm that exploits the hierarchical structure of the representation to perform fast 3D transformations and shading. The algorithm is extended to surface splatting which yields high quality anti-aliased and water tight surface renderings. Our pure software implementation renders up to 14 million Phong shaded and textured samples per second and about 4 million anti-aliased surface splats on a commodity PC. This is more than a factor 10 times faster than previous algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Real-Time Point Cloud Refinement

Splatting-based rendering techniques are currently the best choice for efficient high quality rendering of pointbased geometries. However, such techniques are not suitable for large magnification, especially when the object is under-sampled. This paper improves the rendering quality of pure splatting techniques using a fast dynamic up-sampling algorithm for point-based geometry. Our algorithm i...

متن کامل

Dynamic surfel set refinement for high-quality rendering

Splatting-based rendering techniques are currently the best choice for efficient high-quality rendering of point-based geometries. However, such techniques are not suitable for large magnification, especially when the object is undersampled. This paper improves the rendering quality of pure splatting techniques using a fast dynamic up-sampling algorithm for point-based geometry. Our algorithm i...

متن کامل

A Parallelly Decodeable Compression Scheme for Efficient Point-Cloud Rendering

We present a point-cloud compression algorithm that allows fast parallel decompression on the GPU for interactive applications. We achieve bitrates of less than four bits per normal-equipped point. Our method enables holefree level-of-detail point rendering. We also show that using only up to two bits per point, high-quality renderings can still be obtained if normals are estimated in image-spa...

متن کامل

Continuous reconstruction, rendering, and editing of point-sampled surfaces

The mathematical representation of surfaces is at the core of most computer graphics problems. In particular, the design of modeling and rendering algorithms for computer graphics applications is largely determined by the specific surface representation that is chosen. A variety of mathematical models has been developed for such applications, ranging from parametric to implicit surfaces. In thi...

متن کامل

Efficient Method for Point-Based Rendering on GPUs

We describe methods for high-performance and high-quality rendering of point models, including advanced shading, anti-aliasing, and transparency. we keep the rendering quality as the previous GPU-based point rendering approaches, while involving normal vector computation for each frame. We also present efficient data structures for hierarchical rendering on modern graphics processors (GPUs). In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002